Arbitrary Orientations of Hamilton Cycles in Digraphs
نویسندگان
چکیده
Let n be sufficiently large and suppose that G is a digraph on n vertices where every vertex has inand outdegree at least n/2. We show that G contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Molla, where the threshold is n/2 + 1. Our result is best possible and improves on an approximate result by Häggkvist and Thomason.
منابع مشابه
Packing and counting arbitrary Hamilton cycles in random digraphs
We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in D(n, p) for nearly optimal p (up to a logc n factor). In particular, we show that given t = (1 − o(1))np Hamilton cycles C1, . . . , Ct, each of which is oriented arbitrarily, a digraph D ∼ D(n, p) w.h.p. contains edge disjoint copies of C1, . . . , Ct, provided p = ω(log 3 n/n). We also show that given an arbitr...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملAn Algorithm for Finding Hamilton Cycles in Random Directed Graphs
We describe a polynomial (O( n’.‘)) time algorithm DHAM for finding hamilton cycles in digraphs. For digraphs chosen uniformly at random from the set of digraphs with vertex set (1,2,. . . , n } and m = m(n) edges the limiting probability (as n + co) that DHAM finds a hamilton cycle equals the limiting probability that the digraph is hamiltonian. Some applications to random “ travelling salesma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 29 شماره
صفحات -
تاریخ انتشار 2015